Zeta functions of graphs : a stroll through the garden , by Audrey Terras , Cambridge
نویسنده
چکیده
1.2. Dirichlet. A sequence of numbers a1, a2, . . . gives rise to a Dirichlet series f(s) = ∑ n≥1 ann −s. This is but a method of encoding the infinitely many numbers (an) into a single mathematical object f . If the numbers an grow at most polynomially, then f will actually be an analytic function on a half-plane { (s) > λ}; and the abscissa of convergence λ is related to the growth of the sequence in that a1 + · · · + an n. Much finer asymptotic information on the sequence (e.g., in the form of an approximation an ∝ n(log n)) can be obtained by finer analytic properties of f . This goes under the headline of Abelian and Tauberian theorems. Gustav Lejeune Dirichlet (1805–1859) did much more than get his name attributed to a general form of formal series; he considered expressions of the form ∑ n≥1 χ(n)n −s for a multiplicative character χ of Z/NZ. Such expressions are
منابع مشابه
What are zeta functions of graphs and what are they good for ? Matthew
We discuss zeta functions of finite irregular undirected connected graphs (which may be weighted) and apply them to obtain, for example an analog of the prime number theorem for cycles in graphs. We consider 3 types of zeta functions of graphs: vertex, edge, and path. Analogs of the Riemann hypothesis are also introduced.
متن کاملZeta Functions of Finite Graphs and Coverings, Iii
A graph theoretical analogue of Brauer-Siegel theory for zeta functions of number elds is developed using the theory of Artin L-functions for Galois coverings of graphs from parts I and II. In the process, we discuss possible versions of the Riemann hypothesis for the Ihara zeta function of an irregular graph.
متن کاملZeta Functions of Weighted Graphs and Covering Graphs
We nd a condition for weights on the edges of a graph which insures that the Ihara zeta function has a 3-term determinant formula. Then we investigate the locations of poles of abelian graph coverings and compare the results with random covers. We discover that the zeta function of the random cover satis es an approximate Riemann hypothesis while that of the abelian cover does not.
متن کاملLooking into a Graph Theory Mirror of Number Theoretic Zetas
1. Introduction to the Ihara zeta. We always assume that our graphs X are nite, connected, possibly irregular, of rank 1 with no danglers (i.e., degree 1 vertices). Here rankmeans the rank of the fundamental group of the graph. Let us recall some of the basic de nitions. References include Hashimoto [5], Stark and Terras [23], [24], [25] and the draft of a book [28]. For the generalization t...
متن کاملFinite Quantum Chaos
Quantum chaos is in part the study of the statistics of energy levels of a quantum system; i.e., the eigenvalues of the Schrödinger operator. Thus physicists began to investigate the spectra of random large matrices. Similarly number theorists and geometers have investigated the statistics of spectra of Laplacians on Riemannian manifolds which is equivalent to studying the statistics of the zer...
متن کامل